Ramsey Number of a Connected Triangle Matching
نویسندگان
چکیده
منابع مشابه
Ramsey Number of a Connected Triangle Matching
We determine the 2-color Ramsey number of a connected triangle matching c(nK3) which is a graph with n vertex disjoint triangles plus (at least n − 1) further edges that keep these triangles connected. We obtain that R(c(nK3), c(nK3)) = 7n − 2, somewhat larger than in the classical result of Burr, Erdős and Spencer for a triangle matching, R(nK3, nK3) = 5n. The motivation is to determine the Ra...
متن کاملThe anti-Ramsey number of perfect matching
An r-edge coloring of a graph G is a mapping h : E(G) → [r], where h(e) is the color assigned to edge e ∈ E(G). An exact r-edge coloring is an r-edge coloring h such that there exists an e ∈ E(G) with h(e) = i for all i ∈ [r]. Let h be an edge coloring of G. We say G is rainbow if no two edges in G are assigned the same color by h. The anti-Ramsey number, AR(G,n), is the smallest integer r such...
متن کاملOn the Ramsey number of the triangle and the cube
The Ramsey number r(K3, Qn) is the smallest integer N such that every redblue colouring of the edges of the complete graph KN contains either a red n-dimensional hypercube, or a blue triangle. Almost thirty years ago, Burr and Erdős conjectured that r(K3, Qn) = 2 n+1 − 1 for every n ∈ N, but the first non-trivial upper bound was obtained only recently, by Conlon, Fox, Lee and Sudakov, who prove...
متن کاملconnected cototal domination number of a graph
a dominating set $d subseteq v$ of a graph $g = (v,e)$ is said to be a connected cototal dominating set if $langle d rangle$ is connected and $langle v-d rangle neq phi$, contains no isolated vertices. a connected cototal dominating set is said to be minimal if no proper subset of $d$ is connected cototal dominating set. the connected cototal domination number $gamma_{ccl}(g)$ of $g$ is the min...
متن کاملRamsey numbers in rainbow triangle free colorings
Given a graph G, we consider the problem of finding the minimum number n such that any k edge colored complete graph on n vertices contains either a three colored triangle or a monochromatic copy of the graph G. This number is found precisely for a C4 and all trees on at most 6 vertices and bounds are provided for general paths.
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Graph Theory
سال: 2015
ISSN: 0364-9024,1097-0118
DOI: 10.1002/jgt.21913